Parallel comparison algorithms for approximation problems
نویسندگان
چکیده
منابع مشابه
Parallel Comparison Algorithms for Approximation Problems
Suppose we have n elements from a totally ordered domain, and we are allowed to perform p parallel comparisons in each time unit (round). In this paper we determine, up to a constant factor, the time complexity of several approximation problems in the common parallel comparison tree model of Valiant, for all admissible values of n, p and e, where e is an accuracy parameter determining the quali...
متن کاملExperimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines
This paper presents an empirical comparison of polynomial-time approximation algorithms and local search heuristics for the problem of minimizing total weighted completion time on unrelated parallel machines. Algorithms with a worst-case performance guarantee are based on rounding a fractional solution to an LP-rela....<ation or to a convex quadratic programming relaxation. We also investigate ...
متن کاملPractical Comparison of Approximation Algorithms for Scheduling Problems
In this paper we consider an experimental study of approximation algorithms for scheduling problems in parallel machines minimizing the average weighted completion time. We implemented approximation algorithms for the following problems: , , , and . We generated about 900 tests over more than 190 different instances and present some practical aspects of the implemented algorithms. We also made ...
متن کاملApproximation Algorithms for Geometric Problems
This chapter surveys approximation algorithms for hard geometric problems. The problems we consider typically take inputs that are point sets or polytopes in twoor three-dimensional space, and seek optimal constructions, (which may be trees, paths, or polytopes). We limit attention to problems for which no polynomial-time exact algorithms are known, and concentrate on bounds for worst-case appr...
متن کاملApproximation Algorithms for Segmentation Problems
We introduce and study a novel genre of optimization problems, which we call segmentation problems, motivated in part by certain aspects of clustering and data mining. For any classical optimization problem, the corresponding segmentation problem seeks to partition a set of cost vectors into several segments, so that the overall cost is optimized. We focus on two natural and interesting (but MA...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 1991
ISSN: 0209-9683,1439-6912
DOI: 10.1007/bf01206355